#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define endl '\n'
const int N = 2e5 + 5;

mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());
int n, m;
char s[N];

void solve() {
  cin >> n;
  rep(i, 1, n) cin >> s[i];
  if (n & 1) {
    cout << -1 << endl;
    return;
  }
  int c = 0;
  rep(i, 1, n) if (s[i] == '(') c += (i & 1) ? 1 : -1;
  rep(k, 0, n / 2) {
    if ((k & 1 && 1 - (n / 2 - k) == c) || ((k & 1) == 0 && n / 2 - k == c)) {
      rep(i, 1, k) cout << '(';
      rep(i, 1, n / 2 - k) cout << "()";
      rep(i, 1, k) cout << ')';
      cout << endl;
      return;
    }
  }
  cout << -1 << endl;
}
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  int t;
  cin >> t;
  while (t--) solve();
  return 0;
}